The finite criss-cross method for hyperbolic programming
نویسندگان
چکیده
In this paper the nite criss-cross method is generalized to solve hyperbolic programming problems. Just as in the case of linear or quadratic programming the criss-cross method can be initialized with any, not necessarily feasible basic solution. Finiteness of the procedure is proved under the usual mild assumptions. Some small numerical examples illustrate the main features of the algorithm.
منابع مشابه
New variants of finite criss-cross pivot algorithms for linear programming
In this paper we generalize the so called rst in last out pivot rule and the most often selected variable pivot rule for the simplex method as proposed in Zhang to the criss cross pivot setting where neither the primal nor the dual feasibility is preserved The nite ness of the new criss cross pivot variants is proven
متن کاملA New Admissible Pivot Method for Linear Programming
We present a new admissible pivot method for linear programming that works with a sequence of improving primal feasible interior points and dual feasible interior points. This method is a practicable variant of the short admissible pivot sequence algorithm, which was suggested by Fukuda and Terlaky. Here, we also show that this method can be modified to terminate in finite pivot steps. Finedly,...
متن کاملThe Linear Complementarity Problem, Sufficient Matrices, and the Criss-Cross Method
Specially structured linear complementarity problems (LCPs) and their solution by the miss-cross method are examined. The criss-cross method is known to be finite for LCPs with positive semidefinite bisymmetric matrices and with P-matrices. It is also a simple finite algorithm for oriented matroid programming problems. Recently Cottle, Pang, and Venkateswaran identified the class of (column, ro...
متن کاملSome generalizations of the criss-cross method for quadratic programming
Three generalizations of the criss-cross method for quadratic programming are presented here. Tucker's, Cottle's and Dantzig's principal pivoting methods are specialized as diagonal and exchange pivots for the linear complementarity problem obtained from a convex quadratic program. A nite criss-cross method, based on least{index resolution, is constructed for solving the LCP. In proving nitenes...
متن کاملOptimal order finite element approximation for a hyperbolic integro-differential equation
Semidiscrete finite element approximation of a hyperbolic type integro-differential equation is studied. The model problem is treated as the wave equation which is perturbed with a memory term. Stability estimates are obtained for a slightly more general problem. These, based on energy method, are used to prove optimal order a priori error estimates.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 114 شماره
صفحات -
تاریخ انتشار 1999